By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
What Article options are available ?   View Cart   

Random Paths and Cuts, Electrical Networks, and Reversible Markov Chains

Kenneth A. Berman and Mokhtar H. Konsowa

pp. 311-319

BibTeX  Abstract Full Text:  PDF

On the Structure of Minimum-Weight $k$-Connected Spanning Networks

Daniel Bienstock, Ernest F. Brickell, and Clyde L. Monma

pp. 320-329

BibTeX  Abstract Full Text:  PDF

Generalizations of the Normal Basis Theorem of Finite Fields

Nader H. Bshouty and Gadiel Seroussi

pp. 330-337

BibTeX  Abstract Full Text:  PDF

Shrinking Lattice Polyhedra

John Cremona and Susan Landau

pp. 338-348

BibTeX  Abstract Full Text:  PDF

Optimal Assembly of an $s$-Stage $k$-Out-of-$n$ System

D. Z. Du and F. K. Hwang

pp. 349-354

BibTeX  Abstract Full Text:  PDF

Canonical Antichains on the Circle and Applications

P. Frankl

pp. 355-363

BibTeX  Abstract Full Text:  PDF

A New Basis for Trades

G. B. Khosrovshahi and S. Ajoodani-Namini

pp. 364-372

BibTeX  Abstract Full Text:  PDF

Computing the Bandwidth of Interval Graphs

Daniel J. Kleitman and Rakesh V. Vohra

pp. 373-375

BibTeX  Abstract Full Text:  PDF

One-Page Book Embedding under Vertex-Neighborhood Constraints

Shlomo Moran and Yaron Wolfstahl

pp. 376-390

BibTeX  Abstract Full Text:  PDF

On the $1.1$ Edge-Coloring of Multigraphs

Takao Nishizeki and Kenichi Kashiwagi

pp. 391-410

BibTeX  Abstract Full Text:  PDF

A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems

Hanif D. Sherali and Warren P. Adams

pp. 411-430

BibTeX  Abstract Full Text:  PDF

Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems

Cun-Quan Zhang

pp. 431-438

BibTeX  Abstract Full Text:  PDF